1

Set Covering and Involutory Bases

Year:
1971
Language:
english
File:
PDF, 840 KB
english, 1971
4

Shared Storage Policies Based on the Duration Stay of Unit Loads

Year:
1990
Language:
english
File:
PDF, 422 KB
english, 1990
5

Note—Some Equivalent Objectives for Dynamic Network Flow Problems

Year:
1982
Language:
english
File:
PDF, 211 KB
english, 1982
6

Minimal Cost Cut Equivalent Networks

Year:
1973
Language:
english
File:
PDF, 388 KB
english, 1973
7

Accumulation Point Location on Tree Networks for Guaranteed Time Distribution

Year:
1990
Language:
english
File:
PDF, 846 KB
english, 1990
9

Application Series, Part 1 || Optimal Defense of Multi-Commodity Networks

Year:
1971
Language:
english
File:
PDF, 1.58 MB
english, 1971
10

Unnetworks, with Applications to Idle Time Scheduling

Year:
1978
Language:
english
File:
PDF, 337 KB
english, 1978
11

Finding the n Most Vital Links in Flow Networks

Year:
1975
Language:
english
File:
PDF, 573 KB
english, 1975
12

Set partitioning based heuristics for interactive routing

Year:
1981
Language:
english
File:
PDF, 880 KB
english, 1981
14

Shared Storage Policies Based on the Duration Stay of Unit Loads

Year:
1990
Language:
english
File:
PDF, 893 KB
english, 1990
17

Scheduling Rules for Parallel Processors

Year:
1977
Language:
english
File:
PDF, 647 KB
english, 1977
18

Theory Series || Set Covering and Involutory Bases

Year:
1971
Language:
english
File:
PDF, 1.51 MB
english, 1971
19

Unnetworks, with Applications to Idle Time Scheduling

Year:
1978
Language:
english
File:
PDF, 585 KB
english, 1978
21

Cyclic Scheduling via Integer Programs with Circular Ones

Year:
1980
Language:
english
File:
PDF, 504 KB
english, 1980
22

Optimal Defense of Multi-Commodity Networks

Year:
1971
Language:
english
File:
PDF, 806 KB
english, 1971
23

Theory Series || Minimal Cost Cut Equivalent Networks

Year:
1973
Language:
english
File:
PDF, 294 KB
english, 1973
24

Some Equivalent Objectives for Dynamic Network Flow Problems

Year:
1982
Language:
english
File:
PDF, 464 KB
english, 1982
25

Accumulation Point Location on Tree Networks for Guaranteed Time Distribution

Year:
1990
Language:
english
File:
PDF, 1.55 MB
english, 1990
27

Interactive optimization methodology for fleet scheduling

Year:
1991
Language:
english
File:
PDF, 431 KB
english, 1991
31

Circular dichroism evidence for G·U and G·T base pairing in poly[r(G-U)] and poly[d(G-T)]

Year:
1977
Language:
english
File:
PDF, 575 KB
english, 1977
36

A cut approach to a class of quadratic integer programming problems

Year:
1980
Language:
english
File:
PDF, 297 KB
english, 1980
37

Hierarchical solution of network flow problems

Year:
1990
Language:
english
File:
PDF, 954 KB
english, 1990
38

On an edge ranking problem of trees and graphs

Year:
1991
Language:
english
File:
PDF, 724 KB
english, 1991
41

Sequencing inputs to multi-commodity pipelines

Year:
1995
Language:
english
File:
PDF, 1.93 MB
english, 1995
42

Optimal node ranking of trees

Year:
1988
Language:
english
File:
PDF, 671 KB
english, 1988
46

Complexities of electing diverse committees

Year:
2014
Language:
english
File:
PDF, 320 KB
english, 2014
49

A Network-Flow Model for Racially Balancing Schools

Year:
1972
Language:
english
File:
PDF, 320 KB
english, 1972